LONGEST AND HUBER RESPOND

Martina Huber KTH report

Anisotropic Huber-L1 Optical Flow

TV regularization is an L1 penalization of the flow gradient magnitudes, and due to the tendency of the L1 norm to favor sparse solutions (i.e. lots of ‘zeros’), the fill-in effect caused by the regularizer leads to piecewise constant solutions in weakly textured areas. This effect, known as ‘staircasing’ in a 1D setting, can be reduced significantly by using a quadratic penalization for small ...

Huber Publishers Berne Stuttgart Toronto

The "International Journal for Vitamin and Nutri t ion Research" is published at irregular intervals (about 4 fasc. per annum) 4 fasc. = 1 volume, prize per volume= Sw.Fr. 134.— / Die «Internat ionale Zeitschrift für Vitaminund Ernährungsforschung» erscheint in zwangloser Reihenfolge (ca. 4 Hefte pro Jahr). 4 Hefte ergeben einen Band. Bezugspreis pro Band = sFr. 134.—, D M 170.— / Le «Journa l ...

Longest Biased Interval and Longest Non-negative Sum Interval

UNLABELLED Described is an algorithm to find the longest interval having at least a specified minimum bias in a sequence of characters (bases, amino acids), e.g. 'at least 0.95 (A+T)-rich'. It is based on an algorithm to find the longest interval having a non-negative sum in a sequence of positive and negative numbers. In practice, it runs in linear time; this can be guaranteed if the bias is r...

Intersecting longest paths and longest cycles: A survey

This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed. ...